Roughly Weighted Hierarchical Simple Games

نویسندگان

  • Ali Hameed
  • Arkadii M. Slinko
چکیده

Hierarchical simple games both disjunctive and conjunctive are natural generalizations of simple majority games. They take their origin in the theory of secret sharing. Another important generalization of simple majority games with origin in economics and politics are weighted and roughly weighted majority games. In this paper we characterize roughly weighted hierarchical games identifying where the two approaches coincide.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weighted and roughly weighted simple games

This paper contributes to the program of numerical characterisation and classification of simple games outlined in the classical monograph of von Neumann and Morgenstern [22]. One of the most fundamental questions of this program is what makes a simple game a weighted majority game. The necessary and sufficient conditions that guarantee weightedness were obtained by Elgot [3] and refined by Tay...

متن کامل

Weightedness and structural characterization of hierarchical simple games

In this paper we give structural charaterizations for disjunctive and conjunctive hierarchical simple games by characterizing them as complete games with a unique shift-maximal losing and, respectively, shift-minimal winning coalitions. We prove canonical representation theorems for both types of hierarchical games and establish duality between them. We characterize those disjunctive and conjun...

متن کامل

On $α$-roughly weighted games

Gvozdeva, Hemaspaandra, and Slinko (2011) have introduced three hierarchies for simple games in order to measure the distance of a given simple game to the class of (roughly) weighted voting games. Their third class Cα consists of all simple games permitting a weighted representation such that each winning coalition has a weight of at least 1 and each losing coalition a weight of at most α. For...

متن کامل

On \({\alpha }\) -roughly weighted games

Gvozdeva, Hemaspaandra, and Slinko (2011) have introduced three hierarchies for simple games in order to measure the distance of a given simple game to the class of (roughly) weighted voting games. Their third class Cα consists of all simple games permitting a weighted representation such that each winning coalition has a weight of at least 1 and each losing coalition a weight of at most α. For...

متن کامل

Hierarchical Simple Games: Weightedness and Structural Characterization

In many situations, both in human and artificial societies, cooperating agents have different status with respect to the activity and it is not uncommon that certain actions are only allowed to coalitions that satisfy certain criteria, e.g., to sufficiently large coalitions or coalitions which involve players of sufficient seniority. Simmons (1988) formalized this idea in the context of secret ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. J. Game Theory

دوره 44  شماره 

صفحات  -

تاریخ انتشار 2015